Maximality-based Region Graph: A Novel Alternative
نویسندگان
چکیده
Timed automata with durational actions (daTA) are a form of timed automata that admit a more natural representation of durational actions and capturing true concurrency, with those additional benefits the kinds of properties to be verified on real-time systems will be enlarged. We present a novel approach to construct a region graph, based on the maximality semantics and preserving that specificity. More precisely, we renew the maximality capabilities on the region graph; we propose the MRG construction algorithm. We also describe an implementation of this construction (TaMaRG tool). The approach is illustrated by means a case study.
منابع مشابه
T Maximality - based Step Graph for Safety - Petri Nets
This paper proposes for safety-petri nets an algorithm for reducing on the fly a Maximality-based Labeled Transition Systems via partial order technique, in which made possible the consideration of the branches, therefore the reduction is important. The reduction graph (Maximality-based Step Graph) is a complete graph preserving the general properties (deadlock states and liveness).
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملThe b-domatic number of a graph
Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions. When independent sets are replaced by dominating sets, the parameters corresponding to the chromatic and achromatic numbers are the domatic ...
متن کاملOn certain maximality principles
We present streamlined proofs of certain maximality principles studied by Hamkins and Woodin. Moreover, we formulate an intermediate maximality principle, which is shown here to be equiconsistent with the existence of a weakly compact cardinal $kappa$ such that $V_{kappa}prec V$.
متن کاملMore inequalities for Laplacian indices by way of majorization
The n-tuple of Laplacian characteristic values of a graph is majorized by the conjugate sequence of its degrees. Using that result we find a collection of general inequalities for a number of Laplacian indices expressed in terms of the conjugate degrees, and then with a maximality argument, we find tight general bounds expressed in terms of the size of the vertex set n and the average degree dG...
متن کامل